On the Elimination of Quantifiers through Descriptors in Predicate Logic
نویسندگان
چکیده
We present a variant of the Davis–Fechter’s technique for eliminating quantifiers in first-order logic, aimed at reducing the incidence of irrelevant dependencies in the construction of Skolem terms. The basic idea behind this contribution is to treat as a single syntactic unit every maximal ‘quantifier batch’, i.e., group of contiguous alike quantifiers, whose internal order (which has no significance) is thereby prevented from entangling the final result. Through concrete cross-translations, our version of the free-variable predicate calculus turns out to be equipollent—in means of expression and of proof—to the one originally proposed by Davis and Fechter and hence to a relatively conventional version of quantified first-order logic.
منابع مشابه
Almost everywhere elimination of probability quantifiers
We obtain an almost everywhere quantifier elimination for (the noncritical fragment of) the logic with probability quantifiers, introduced by the first author in [10]. This logic has quantifiers like ∃≥3/4y, which says that “for at least 3/4 of all y”. These results improve upon the 0-1 law for a fragment of this logic obtained by Knyazev [11]. Our improvements are: 1. We deal with the quantifi...
متن کاملAlmost Everywhere Elimination of Probability Quantifiers H. Jerome Keisler and Wafik Boulos Lotfallah
We obtain an almost everywhere quantifier elimination for (the noncritical fragment of) the logic with probability quantifiers, introduced by the first author in [9]. This logic has quantifiers like ∃≥3/4y, which says that “for at least 3/4 of all y”. These results improve upon the 0-1 law for a fragment of this logic obtained by Knyazev [11]. Our improvements are: 1. We deal with the quantifie...
متن کاملQuantifier Elimination in Second-Order Predicate Logic
An algorithm is presented which eliminates second–order quantifiers over predicate variables in formulae of type ∃P1, . . . , Pnψ where ψ is an arbitrary formula of first– order predicate logic. The resulting formula is equivalent to the original formula – if the algorithm terminates. The algorithm can for example be applied to do interpolation, to eliminate the second–order quantifiers in circ...
متن کاملQuantifier Elimination and Real Closed Ordered Fields with a Predicate for the Powers of Two
In this thesis we first review the model theory of quantifier elimination and investigate the logical relations among various quantifier elimination tests. In particular we prove the equivalence of two quantifier elimination tests for countable theories. Next we give a procedure for eliminating quantifiers for the theory of real closed ordered fields with a predicate for the powers of two. This...
متن کاملApproximating Resultants of Existential Second-Order Quantifier Elimination upon Universal Relational First-Order Formulas
We investigate second-order quantifier elimination for a class of formulas characterized by a restriction on the quantifier prefix: existential predicate quantifiers followed by universal individual quantifiers and a relational matrix. For a given second-order formula of this class a possibly infinite sequence of universal first-order formulas that have increasing strength and are all entailed ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012